<HTML><HEAD><TITLE>library(all_min_cuts_eplex)</TITLE></HEAD><BODY>
[ <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]<H1>library(all_min_cuts_eplex)</H1>
Mixed integer programming solution for generating all minimum-cost cuts
<H2>Predicates</H2>
<BLOCKQUOTE>
<DL>
<DT><A HREF="all_min_cuts_eplex-7.html"><STRONG>all_min_cuts_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, -MaxFlowValue, -MinCuts, -MinCutEdges)</STRONG></A></DT>
<DD>MIP algorithm for generating all minimum-cost cuts</DD>
<DT><A HREF="all_min_cuts_eplex-8.html"><STRONG>all_min_cuts_eplex(+Graph, +CapacityArg, +SourceNode, +SinkNode, +Limit, -MaxFlowValue, -MinCuts, -MinCutEdges)</STRONG></A></DT>
<DD>MIP algorithm for generating all minimum-cost cuts, with a limit for max allowed number of generated cuts</DD>
</DL>
</BLOCKQUOTE>
<H2>Description</H2>
Mixed integer programming solution for generating all minimum-cost cuts between given source and sink nodes. This formulation was used as a comparison algorithm in the experimental section of [Norman D. Curet, Jason DeVinney, Matthew E. Gaston. An efficient network flow code for finding all minimum cost s-t cutsets. Computers &amp; Operations Research 29 (2002) 205-219]. The idea is to iteratively solve dual max flow problem, and at each iteration, post an additional contraint to avoid repeating the same cuts.
<H2>About</H2><UL COMPACT>
<LI><STRONG>Status: </STRONG>prototype
<LI><STRONG>Author: </STRONG>CrossCore Optimization Ltd
<LI><STRONG>Copyright &copy; </STRONG>2007, CrossCore Optimization Ltd
<LI><STRONG>Date: </STRONG>2006-2007
</UL>
<HR>Generated from all_min_cuts_eplex.eci on 2009-05-27 01:25
</BODY></HTML>
